#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);

    LL n,m;cin>>n>>m;
    for(LL i=1;i<=n;i++) cin>>a[i];
    LL sum=0;
    for(LL i=1;i<=n;i++) if(a[i]==1) sum++;
    while(m--){
        LL op;cin>>op;
        if(op==1){
            LL x;cin>>x;
            if(a[x]==1) sum--,a[x]=0;
            else if(a[x]==0) sum++,a[x]=1;
        }
        else if(op==2){
            LL k;cin>>k;
            if(k>sum){
                cout<<"0"<<"\n";
            }
            else cout<<"1"<<"\n";
        }
    }

return 0;
}
